Non-deterministic Semantics in Polynomial Format
نویسندگان
چکیده
منابع مشابه
Distance-Based Non-Deterministic Semantics
Representing uncertainty and reasoning with dynamically evolving systems are two related issues that are in the heart of many information systems. In this paper we show that these tasks can be successfully dealt with by incorporating distance semantics and nondeterministic matrices. The outcome is a general framework for capturing the principle of minimal change and providing a non-deterministi...
متن کاملNon-deterministic Semantics for Dynamic Topological Logic
Dynamic Topological Logic (DT L) is a combination of S4, under its topological interpretation, and the temporal logic LT L interpreted over the natural numbers. DT L is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples 〈X, T , f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V ...
متن کاملA Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a ∧ b ⊃ c, then c should be an obvious implication. However, devising a tractable semantics that allows unit resolution has proven to be an elusive goal. We propose a 3-valued semantics for a tractable fragment of propositional logic that is inherently ...
متن کاملCompositional Semantics of Non-Deterministic Synchronous Languages
A key feature of synchronous languages is that they conciliate con-currency with determinism. This is achieved by detecting so-called causality errors BG92, HM95, STB95], which occur when the composition of deterministic processes is not deterministic. Although the existing synchronous languages only deal with deterministic programs, it is not a restriction of the approach. We show how a synchr...
متن کاملRelational Semantics of Non-Deterministic Dataflow
We recast dataflow in a modern categorical light using profunctors as a generalization of relations. The well known causal anomalies associated with relational semantics of indeterminate dataflow are avoided, but still we preserve much of the intuitions of a relational model. The development fits with the view of categories of models for concurrency and the general treatment of bisimulation the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2014
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2014.06.003